On absorption in semigroups and n-ary semigroups

نویسنده

  • Bojan Basic
چکیده

The notion of absorption was developed a few years ago by Barto and Kozik and immediately found many applications, particularly in topics related to the constraint satisfaction problem. We investigate the behavior of absorption in semigroups and n-ary semigroups (that is, algebras with one n-ary associative operation). In the case of semigroups, we give a simple necessary and sufficient condition for a semigroup to be absorbed by its subsemigroup. We then proceed to n-ary semigroups, where we conjecture an analogue of this necessary and sufficient condition, and prove that the conjectured condition is indeed necessary and sufficient for B to absorb A (where A is an n-ary semigroup and B is its n-ary subsemigroup) in the following three cases: when A is commutative, when |A \ B| = 1 and when A is an idempotent ternary semigroup. Mathematics Subject Classification (2010): 08A70, 20M99, 03B25, 68Q17

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A NOVEL STUDY ON FUZZY CONGRUENCES ON n-ARY SEMIGROUPS

In this paper, we introduce the concept of fuzzy congruences on n-ary semigroups and describe quotient n-ary semigroups by fuzzy congruences. Some isomorphism theorems about n-ary semigroups are established. Moreover, we discuss a special kind of n-ary semigroups. We also establish relationships between normal fuzzy ideals and fuzzy congruences. In particular, we prove that there exists a prese...

متن کامل

On the n-ary algebras, semigroups and their universal

For any n-ary associative algebra we construct a Zn−1 graded algebra, which is a universal object containing the n-ary algebra as a subspace of elements of degree 1. Similar construction is carried out for semigroups. AMS Classification: 17A42, 16N34, 20N15

متن کامل

Generalization of Czogała-Drewniak Theorem for n-ary Semigroups

We investigate n-ary semigroups as a natural generalization of binary semigroups. We refer it as a pair (X ,Fn), where X is a set and an n-associative function Fn : Xn → X is defined on X . We show that if Fn is idempotent, n-associative function which is monotone in each of its variables, defined on an interval I ⊂ R and has a neutral element, then Fn is combination of the minimum and maximum ...

متن کامل

n–ary hyperstructures constructed from binary quasi–ordered semigroups

Based on works by Davvaz, Vougiouklis and Leoreanu-Fotea in the field of n–ary hyperstructures and binary relations we present a construction of n–ary hyperstructures from binary quasi-ordered semigroups. We not only construct the hyperstructures but also study their important elements such as identities, scalar identities or zeros. We also relate the results to earlier results obtained for a s...

متن کامل

A DESCRIPTION OF n-ARY SEMIGROUPS POLYNOMIAL-DERIVED FROM INTEGRAL DOMAINS

We provide a complete classification of the n-ary semigroup structures defined by polynomial functions over infinite commutative integral domains with identity, thus generalizing G lazek and Gleichgewicht’s classification of ternary semigroups.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Logical Methods in Computer Science

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2015